Finding maximal and minimal elements in a set is capacity-unlimited and massively-parallel
نویسندگان
چکیده
منابع مشابه
Imperfect, Unlimited-Capacity, Parallel Search Yields Large Set-Size Effects
Many analyses of visual search assume error-free component processes. These analyses range from Sternberg's earliest serial models to Townsend's sophisticated theorems of serial-parallel equivalence. Consider a simple "yes-no" visual search task with a set-size manipulation. For the correct positive responses, an error-free, unlimited-capacity, parallel search model predicts no effect of set si...
متن کاملConstructing a Maximal Independent Set in Parallel
f a The problem of constructing in parallel a maximal independent set o given graph is considered. A new deterministic NC -algorithm implet mented in the EREW PRAM model is presented. On graphs with n ver ices and m edges, it uses O ((n +m )/logn ) processors and runs in O (log n ) 3 c time. This reduces by a factor of logn both the running time and the pro essor count of the previously fastest...
متن کاملAnalysis of parallel algorithms for finding a maximal independent set in a random hypergraph
It is well known 9] that nding a maximal independent set in a graph is in class N C, and 10] that nding a maximal independent set in a hypergraph with xed dimension is in RN C. It is not known whether this latter problem remains in N C when the dimension is part of the input. We will study the problem when the problem instances are randomly chosen. It was shown in 6] that the expected running t...
متن کاملMAXIMAL ALLOCATED BENEFIT AND MINIMAL ALLOCATED COST AND ITS APPLICATION
In this paper, we investigate the problems of consensus-making among institution in stock exchange with multiple criteria for evaluating performance when the players (institutions) are supposed to be egoistic and the score for each criterion for a player is supposed to be a positive score. Each player sticks to his superiority regarding the criteria. This paper introduces the models for computi...
متن کاملParallel Algorithms for Maximal Independent Set and Maximal Matching
We present a derandomization process which leads to efficient parallel algorithms for the maximal independent set and maximal matching problems. The derandomization of the general pairs PROFIT/COST problem depends on the derandomization of the bit pairs PROFIT/COST problem which follows Luby’s approach of using an O(n) sized sample space. This simplifies the approach presented in [16].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2017
ISSN: 1534-7362
DOI: 10.1167/17.10.1284